s, k = input().split()
s = list(s)
k = int(k)
n = len(s)
def find_best_move(start):
best_move = s[start]
best_move_index = None
for i in range(start, min(start + k + 1, n)):
if s[i] > best_move:
best_move = s[i]
best_move_index = i
return best_move_index
def swap(i, j):
for index in range(j, i, -1):
c = s[index]
s[index] = s[index - 1]
s[index - 1] = c
for i in range(n):
pos = find_best_move(i)
if not pos:
continue
nb_swap = pos - i
if pos and nb_swap <= k:
swap(i, pos)
k = k - nb_swap
print(''.join(s))
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{ int a,k;
cin>>a>>k;
vector<int>digits;
while(a)
{ digits.push_back(a%10);
a/=10;
}
reverse(digits.begin(),digits.end());
int n=digits.size();
while(k)
{ bool flag=false;
for(int i=0;i<digits.size()-1;i++)
{ if(digits[i]!=9)
{ int index=-1;
int maxi=digits[i];
for(int j=i+1;j<=min(i+k,n-1);j++)
{ if(digits[j]>maxi)
{ maxi=digits[j];
index=j;
}
}
if(index!=-1)
{ k-=(index-i);
int temp=digits[index];
for(int j=index;j>=i+1;j--)
digits[j]=digits[j-1];
digits[i]=temp;
flag=true;
break;
}
}
}
if(flag==false)
break;
}
string ans="";
for(int i=0;i<n;i++)
ans+=(digits[i]+'0');
cout<<ans;
return 0;
}1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |